A note on stochastic bounds for queueing networks
نویسندگان
چکیده
منابع مشابه
Bounds and error bounds for queueing networks
Queueing networks are an important means to model and evaluate a variety of practical systems. Unfortunately, analytic results are often not available. Numerical computation may then have to be employed. Or, system modifications might be suggested to obtain simple bounds or computationally easy approximations. Formal analytic support for the accuaracy or nature of such modifications or approxim...
متن کاملStochastic Bounds for Queueing Systems with Multiple On-O Sources
Consider a queueing system where the input traac consists of background traac, modeled by a Markov Arrival Process (MAP), and foreground traac modeled by N 1 homogeneous on-oo sources. The queueing system has an increasing and concave service rate, which includes as a particular case multi-server queueing systems. Both the innnite-capacity and the nite-capacity buuer cases are analyzed. We show...
متن کاملStochastic Bounds for Queueing Systems with Multiple On-Off Sources
Consider a queueing system where the input traffic consists of background traffic, modeled by a Markov Arrival Process (MAP), and foreground traffic modeled by N ≥ 1 homogeneous on-off sources. The queueing system has an increasing and concave service rate, which includes as a particular case multi-server queueing systems. Both the infinite-capacity and the finitecapacity buffer cases are analy...
متن کاملStochastic Bounds on Delays of Fair Queueing Algorithms
In this paper we study the delay characteristics of Fair Queueing algorithms with a stochastic comparison approach. In integrated services networks, Fair Queueing (FQ) algorithms have received much attention, because they can guarantee an end-to-end session delay bound when the burstiness of the session traac is bounded, and they ensure the fair allocation of the bandwidth. The delay characteri...
متن کاملA Note on Insensitivity in Stochastic Networks
Wegive a simple and direct treatment of insensitivity in stochastic networkswhich is quite general and provides probabilistic insight into the phenomenon. In the case of multi-class networks, our results generalise those of Bonald and Proutière (2002), (2003).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1984
ISSN: 0001-8678,1475-6064
DOI: 10.2307/1427349